Convexity and Order in Probabilistic Call-by-Name FPC
نویسنده
چکیده
In the present paper, Kegelspitzen, which can be seen dcpos associated with a compatible convex structure, will be shown to be models of the order-enriched Lawvere theory of subconvex sets and later used to adequately interpret PFPC, a probabilistic version of the well-known functional programming language FPC (Fixed Point Calculus) [8], which involves recursive types.
منابع مشابه
Implicational Scaling of Reading Comprehension Construct: Is it Deterministic or Probabilistic?
In English as a Second Language Teaching and Testing situations, it is common to infer about learners’ reading ability based on his or her total score on a reading test. This assumes the unidimensional and reproducible nature of reading items. However, few researches have been conducted to probe the issue through psychometric analyses. In the present study, the IELTS exemplar module C (1994) wa...
متن کاملA universal realizability model for sequential functional computation
We construct a universal and even logically fully abstract realizability model for the sequential functional programming language of call-by-name FPC. This model is defined within the category of modest sets over the total combinatory algebra L of observational equivalence classes of closed terms of the untyped programming language λ+Error. This language is untyped lazy call-by-name lambda-calc...
متن کاملOn Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is generalized to a typed, call-by-value, lambda-calculus. Surprisingly, the obtained relation coincides with context equivalence, contrary to what happens when call-by-name evaluation is considered. Even more sur...
متن کاملProbabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (Long Version)
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is generalized to a typed, call-by-value, lambda-calculus. Surprisingly, the obtained relation coincides with context equivalence, contrary to what happens when call-by-name evaluation is considered. Even more sur...
متن کاملOn Probabilistic Applicative Bisimulation and Call-by-Value $\lambda$-Calculi (Long Version)
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is generalized to a typed, call-by-value, lambda-calculus. Surprisingly, the obtained relation coincides with context equivalence, contrary to what happens when call-by-name evaluation is considered. Even more sur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1607.04332 شماره
صفحات -
تاریخ انتشار 2016